CS 340, Fall 2014 — Dec 11th /13th — Final Exam Name: Note: in all questions, the special symbol  (epsilon) is used to indicate the empty string. Questionpoints] Consider the following regular expression;

Source URL: ycpcs.github.io

• Formal languages
• Compiler construction
• Pattern matching
• Syntax
• Parsing
• Context-free grammar
• Formal grammar
• Terminal and nonterminal symbols
• Lexical analysis
• Recursive descent parser
• Sequence
• Regular expression

SECURITY The Bugs We Have to Kill S E R G E Y B R AT U S , M E R E D I T H L . PAT T E R S O N , A N D A N N A S H U B I N A

Source URL: langsec.org

• Software engineering
• Software
• Computer programming
• Compiler construction
• Parsing
• Formal languages
• Parser combinator
• Syntax
• Computability
• Compiler-compiler
• Compiler
• Domain-specific language

REPORTS IN INFORMATICS ISSN

Source URL: www.ii.uib.no

• Logic
• Mathematics
• Abstraction
• Model theory
• Formal languages
• Metalogic
• Mathematical logic
• Interpretation
• Compactness theorem
• Well-formed formula
• Constructible universe
• IP

A comparative study of programmer-written and automatically inferred contracts Nadia Polikarpova, Ilinca Ciupa, Bertrand Meyer Chair of Software Engineering, ETH Zurich, Switzerland {firstname.lastname}@inf.ethz.ch

Source URL: se.ethz.ch

• Software engineering
• Computer programming
• Software
• Formal methods
• Logic in computer science
• Object-oriented programming languages
• Object-oriented programming
• Software testing
• Postcondition
• Eiffel
• Assertion
• Class invariant

LACL 2012 Logical Aspects of Computational Linguistics System Demonstrations

Source URL: lacl.gforge.inria.fr

• Linguistics
• Grammar
• Formal languages
• Cognitive science
• Syntax
• Tree-adjoining grammar
• Categorial grammar

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Proof assistants
• Formal methods
• Isabelle
• Type theory
• HOL
• Automated reasoning
• Computer algebra system
• Vienna Development Method
• Software development

COMP 520 FallScanners and Parsers (1) Scanners and parsers

Source URL: www.sable.mcgill.ca

• Software
• Computing
• Compiling tools
• Formal languages
• Finite automata
• Parser generators
• Compiler construction
• Flex
• Printf format string
• Lexical analysis
• GNU bison
• Regular expression

Description Logic: A Formal Foundation for Ontology Languages and Tools Part 2: Tools Ian Horrocks

Source URL: www.cs.ox.ac.uk

The Lane Table Method Of Constructing LR(1) Parsers David Pager Xin Chen Department of Information and Computer Science

Source URL: cssauh.com

• Parser generators
• Formal languages
• LALR parser
• LR parser
• Parsing
• Yacc
• Compiler-compiler
• PLY
• Formal grammar
• LALR parser generator
• Simple LR parser

Towards a Proof Theory for Multi-Agent Logics with Irrevocable Strategies 1 ˚ Thomas Agotnes , Valentin Goranko2 , and Wojciech Jamroga3

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Philosophy
• Model theory
• Formal languages
• Logical truth
• Propositional calculus
• Linear temporal logic
• Temporal logic
• Interpretation
• Substitution
• operator